Computational category theory

نویسندگان

  • David E. Rydeheard
  • Rod M. Burstall
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guarded Computational Type Theory

We develop a computational interpretation of guarded dependent type theory with clocks called CTT which enjoys a straightforward operational semantics and immediate canonicity result for base types. Our realizability-style presentation of guarded type theory is a computational and syntactic alternative to category-theoretic accounts of guarded recursion, emphasizing type theory’s role as the ul...

متن کامل

Semantic Packing As a Core Mechanism of Category Coherence, Fast Mapping and Basic Level Categories

In the present study, category coherence, a question why intuitive groupings for natural categories exist, is considered by applying a computational theory that models discrimination and generalization. The computational process is what we called “semantic packing”. In the model, category learners’ two conflicting constraints on discrimination and generalization are optimized simultaneously as ...

متن کامل

A Combinatorial Deenition of Baez-dolan !-categories

We give a new combinatorial deenition of a sort of weak !-category originally devised by J. Baez and J. Dolan in nite dimensional cases. Our deenition is a mixture of both inductive and coinductive deenitions, and suitable for`computational category theory.'

متن کامل

Generic models for computational effects

AFreyd-category is a subtle generalisation of the notion of a categorywith finite products. It is suitable formodelling environments in call-by-value programming languages, such as the computational -calculus, with computational effects.We develop the theory of Freyd-categorieswith that inmind.Wefirst show that any countable Lawvere theory, hence any signature of operationswith countable arity ...

متن کامل

A Combinatorial De nition of Baez-Dolan !-categories

We give a new combinatorial de nition of a sort of weak !category originally devised by J. Baez and J. Dolan in nite dimensional cases. Our de nition is a mixture of both inductive and coinductive de nitions, and suitable for `computational category theory.' Keyword: weak n-category, bicategory, tricategory, formalized mathematics

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988